Balanced graphs with minimum degree constraints
نویسندگان
چکیده
منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملdiameter two graphs of minimum order with given degree set
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
متن کاملCliques in Graphs With Bounded Minimum Degree
Let fr(n, e) be the minimum number of r-cliques in graphs of order n and size e. Determining fr(n, e) has been a long-studied problem. The case r = 3, that is, counting triangles, has been studied by various people. Erdős [3], Lovász and Simonovits [7] studied the case when e = ( n 2 ) /2 + l with 0 < l n/2. Fisher [4] considered the situation when ( n 2 ) /2 e 2 ( n 2 ) /3, but it was not unti...
متن کاملMinimum degree games for graphs
Given δ and n, a minimum degree game starts with n disconnected nodes. Two players alternate, each adding a new edge in turn, until the resulting graph has minimum degree at least δ. In the achievement game, the last player to move is the winner; in the avoidance game, the last to play is the loser. We determine a winning strategy for the avoidance game for every δ and n. The achievement game i...
متن کاملPartitioning and coloring graphs with degree constraints
We prove that if G is a vertex-critical graph with χ(G) ≥ ∆(G) + 1 − p ≥ 4 for some p ∈ N and ω(H(G)) ≤ χ(G)+1 p+1 − 2, then G = Kχ(G) or G = O5. Here H(G) is the subgraph of G induced on the vertices of degree at least χ(G). This simplifies the proofs and improves the results in the paper of Kostochka, Rabern and Stiebitz [8].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90123-w